package acwing.算法题;/**
 * @author： li
 * @date： 2022-03-30 17:21
 * @version 1.0
 */
import java.util.*;
public class n的阶乘的约数个数 {
    static int[] s = new int[]{2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97};
    static int[] count_z = new int[101];
    //求约数个数
    static void count_y(int n){
        for(int i=0;i<25;i++){
            int count=0;
            if(n%s[i]==0){
                while(n%s[i]==0){
                    count++;
                    n/=s[i];
                }
                count_z[s[i]]+=count;
            }
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n =sc.nextInt();
        long ans=1;
        //求出n以内每个素数出现的个数
        for(int i=2;i<=n;i++){
            count_y(i);
        }
        System.out.println(Arrays.toString(count_z));
        //约数个数就是 所有素数出现个数都先加1 再全部相乘
        for(int i=0;i<100;i++){
            if(count_z[i]!=0)
                ans*=(count_z[i]+1);
        }
        System.out.println(ans);
    }
}
